Computing with confidence

In this paper, the dependence spaces are discussed for textural formal concepts considering method given by Ma et al. A complete congruence on a lattice is an equivalence relation if it satisfies infinite substitution property. More generally, join-dependence and meet-dependence space with respect to domain of discourse presented. Using duality in textures, closure interior operators defined obtain intensions co-intensions concept lattices, respectively. The main theorem dual lattices Chen Yao stated. Further, shown that can be obtained using operator. Finally, independency notion Novotný t-formal discussed.